Compressed Sensing with coherent tight frames via $l_q$-minimization for $0<q\leq1$
نویسندگان
چکیده
Our aim of this article is to reconstruct a signal from undersampled data in the situation that the signal is sparse in terms of a tight frame. We present a condition, which is independent of the coherence of the tight frame, to guarantee accurate recovery of signals which are sparse in the tight frame, from undersampled data with minimal l1-norm of transform coefficients. This improves the result in [1]. Also, the lq-minimization (0 < q < 1) approaches are introduced. We show that under a suitable condition, there exists a value q0 ∈ (0, 1] such that for any q ∈ (0, q0), each solution of the lq-minimization is approximately well to the true signal. In particular, when the tight frame is an identity matrix or an orthonormal basis, all results obtained in this paper appeared in [13] and [26].
منابع مشابه
New RIC Bounds via l_q-minimization with 0<q<=1 in Compressed Sensing
The restricted isometry constants (RICs) play an important role in exact recovery theory of sparse signals via `q(0 < q ≤ 1) relaxations in compressed sensing. Recently, Cai and Zhang [6] have achieved a sharp bound δtk < √ 1− 1/t for t ≥ 4 3 to guarantee the exact recovery of k sparse signals through the `1 minimization. This paper aims to establish new RICs bounds via `q(0 < q ≤ 1) relaxation...
متن کاملStable reconstructions for the analysis formulation of ℓp-minimization using redundant systems
A common method to compute sparse solutions in compressed sensing is based on `minimization. In this paper we consider `-minimization for arbitrary 0 < p ≤ 1. More precisely, we prove stability estimates for solutions of the analysis formulation of the `minimization problem for 0 < p ≤ 1 from noisy measurements. Furthermore, our focus lies in arbitrary frames that are not necessarily tight or P...
متن کاملFrames for compressed sensing using coherence
We give some new results on sparse signal recovery in the presence of noise, for weighted spaces. Traditionally, were used dictionaries that have the norm equal to 1, but, for random dictionaries this condition is rarely satised. Moreover, we give better estimations then the ones given recently by Cai, Wang and Xu.
متن کاملApproximate equiangular tight frames for compressed sensing and CDMA applications
Performance guarantees for recovery algorithms employed in sparse representations, and compressed sensing highlights the importance of incoherence. Optimal bounds of incoherence are attained by equiangular unit norm tight frames (ETFs). Although ETFs are important in many applications, they do not exist for all dimensions, while their construction has been proven extremely difficult. In this pa...
متن کاملMinimization of Transformed L1 Penalty: Closed Form Representation and Iterative Thresholding Algorithms
The transformed l1 penalty (TL1) functions are a one parameter family of bilinear transformations composed with the absolute value function. When acting on vectors, the TL1 penalty interpolates l0 and l1 similar to lp norm (p ∈ (0, 1)). In our companion paper, we showed that TL1 is a robust sparsity promoting penalty in compressed sensing (CS) problems for a broad range of incoherent and cohere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1105.3299 شماره
صفحات -
تاریخ انتشار 2011